Computational complexity theory - PDFSEARCH.IO - Document Search Engine

Computational complexity theory
Results: 2049

#	Item
451	Parameterized Complexity News The Newsletter of the Parameterized Complexity Community fpt.wikidot.com May 2009 Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 05:57:59 NP-complete problems Analysis of algorithms Graph coloring Parameterized complexity Complexity classes Kernelization Time complexity Clique problem Vertex cover Theoretical computer science Computational complexity theory Graph theory
452	Parameterized Complexity News The Newsletter of the Parameterized Complexity Community Volume 4, AprilWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 05:58:10 NP-complete problems Analysis of algorithms Parameterized complexity Complexity classes Kernelization Dominating set Feedback vertex set Michael Fellows Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
453	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 On a geometric approach to the segment sum problem and its generalization Asish Mukhopadhyay ∗† Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:26:37 Analysis of algorithms Time complexity Algorithm Selection algorithm SL Theoretical computer science Computational complexity theory Applied mathematics
454	Linear Time Nonparametric Classification and Feature Selection with Polynomial MPMC Cascades for large datasets Markus Breitenbach1 , Sander M. Bohte1,2 , and Gregory Z. Grudic1 1 Add to Reading List Source URL: markus-breitenbach.com Language: English - Date: 2004-06-24 11:16:08 Applied mathematics Linear classifier Ensemble learning Time complexity Support vector machine Algorithm Computational complexity theory Stability Boosting methods for object categorization Machine learning Statistics Statistical classification
455	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 The Generalized Minimum Manhattan Network Problem (GMMN) – Scale-Diversity Aware Approximation and a Primal-Dual Algorithm Stefan Funke∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-21 05:15:26 Convex optimization Operations research Linear programming Mathematical optimization Approximation algorithm Computational complexity theory Optimization problem Duality Algorithm Theoretical computer science Applied mathematics Mathematics
456	Distributed Agreement with Optimal Communication Complexity Seth Gilbert EPFL Abstract We consider the problem of fault-tolerant agreement in Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2009-11-24 09:45:55 Analysis of algorithms Fault-tolerant computer systems Probabilistic complexity theory Consensus Randomized algorithm Distributed algorithm Factorial IP Time complexity Theoretical computer science Computational complexity theory Mathematics
457	CCCG 2011, Toronto ON, August 10–12, 2011 Exact Algorithms and APX-Hardness Results for Geometric Set Cover Timothy M. Chan∗ Abstract Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:12 Approximation algorithms Functions and mappings Computational complexity theory APX Logarithm Integral Function L-reduction Metric Mathematics Theoretical computer science Mathematical analysis
458	MFCS 2008 − Day 1 Monday, August 25 Queries 9:00 − 9:30 Add to Reading List Source URL: mfcs08.mat.umk.pl Language: English - Date: 2008-06-27 01:42:28 Computational complexity theory Graph coloring Algorithm Cellular automaton Complexity Graph theory Coffee Mathematics Theoretical computer science Applied mathematics
459	Book Reviews The Golden Ticket: P, NP, and the Search for the Impossible Lance Fortnow Princeton University Press, 2013, 192 pp ISBN1 Add to Reading List Source URL: www.asiapacific-mathnews.com Language: English - Date: 2014-02-27 03:55:07 Complexity classes NP-complete problems Mathematical optimization NP-complete Computational problems P versus NP problem NP Decision problem Clique problem Theoretical computer science Computational complexity theory Applied mathematics
460	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Terminal Steiner Tree with Bounded Edge Length Zhiyong Lin∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:29:08 NP-complete problems Spanning tree Steiner tree problem Minimum spanning tree Time complexity Approximation algorithm Rectilinear Steiner tree Theoretical computer science Graph theory Computational complexity theory

UPDATE